Rectangular Decomposition of Binary Images
نویسندگان
چکیده
The contribution deals with the most important methods for decomposition of binary images into union of rectangles. The overview includes run-length encoding and its generalization, decompositions based on quadtrees, on the distance transformation, and a theoretically optimal decomposition based on maximal matching in bipartite graphs. We experimentally test their performance in binary image compression and in convolution calculation and compare their computation times and success rates.
منابع مشابه
Block decomposition and segmentation for fast Hough transform evaluation
The decomposition of binary images using rectangular blocks of foreground pixels as primitives is considered. Based on this type of decomposition, a fast method for evaluating the Hough transform is introduced. A complexity analysis of the proposed block Hough transform algorithm sets constraints on the complexity of algorithms used for block decomposition, so that the total decomposition and H...
متن کاملDiagnosis of Tempromandibular Disorders Using Local Binary Patterns
Background: Temporomandibular joint disorder (TMD) might be manifested as structural changes in bone through modification, adaptation or direct destruction. We propose to use Local Binary Pattern (LBP) characteristics and histogram-oriented gradients on the recorded images as a diagnostic tool in TMD assessment.Material and Methods: CBCT images of 66 patients (132 joints) with TMD and 66 normal...
متن کاملUsing difunctional relations in information organization
An algorithm for information organization based on rectangular decomposition of a binary relation is introduced, Rectangular decomposition allows a classification of databases presented as a binary relation. This problem, being NP-Complete problem, has been the subject of several previous works. However, we found out necessary the proposition of an approximate polynomial algorithm and to give a...
متن کاملFast Implementation Of Morphological Operations Using Binary Image Block Decomposition
Morphological transformations are commonly used to perform a variety of image processing tasks. However, morphological operations are time-consuming procedures since they involve ordering and min/max computation of numbers resulting from image interaction with structuring elements. This paper presents a new method that can be used to speed up basic morphological operations for binary images. To...
متن کاملReal-Time Computation of Statistical Moments on Binary Images Using Block Representation for Learning Systems
This paper presents a new approach and an algorithm for binary image representation, which is applied for the fast and efficient computation of moments in binary images. In the terminology of this paper the binary image representation scheme is called block representation, since it represents the image as a set of nonoverlapping rectangular areas. The fast computation of moments in block repres...
متن کامل